Distributional chaos caused by snap-back repeller in metric space

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chaos induced by regular snap - back repellers ✩

This paper is concerned with chaos induced by regular snap-back repellers. One new criterion of chaos induced by strictly coupled-expanding maps in compact sets of metric spaces is established. By employing this criterion, the nondegenerateness assumption in the Marotto theorem established in 1978 is weakened. In addition, it is proved that a regular snap-back repeller and a regular homoclinic ...

متن کامل

Chaos Induced by Snap-back Repellers and Its Applications to Anti-control of Chaos

This paper surveys some recent results about chaos induced by snap-back repellers and its applications to anti-control of chaos (or, chaotification). Several criteria of chaos induced by snap-back repellers in finite and infinite dimensional dynamical systems are introduced. Some successful applications are given to chaotification problems for finite and infinitedimensional discrete dynamical s...

متن کامل

Almost Periodicity and Distributional Chaos in Banach Space

Let (X, ‖ · ‖) be a Banach space, f : X → X continous Freche’t differentiable map.Denote the set of almost periodic point by A(f).In this paper,we prove that there exists an uncountable set Λ such that f |Λ is distributionally chaotic,and Λ ⊂ A(f).

متن کامل

On Chaos of the Logistic Maps

This paper is concerned with chaos of a family of logistic maps. It is first proved that a regular and nondegenerate snap-back repeller implies chaos in the sense of both Devaney and Li-Yorke for a map in a metric space. Based on this result, it is shown that the logistic system is chaotic in the sense of both Devaney and Li-Yorke, and has uniformly positive Lyapunov exponents in an invariant s...

متن کامل

Clustering by density in any metric space

Given a distance matrix on X , establishing partitions (all the elements are clustered in disjoint classes) is generally made optimizing a criterion over the set of all the partitions with a number of classes that must be indicated. In this paper, we investigate a different approach. From the distance matrix, we first build a valued graph Γ = (X,E), for each vertex a density function De is eval...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 2013

ISSN: 0022-247X

DOI: 10.1016/j.jmaa.2013.01.057